0.02/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.32 % Computer : n025.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1200 0.12/0.32 % WCLimit : 120 0.12/0.32 % DateTime : Tue Jul 13 14:35:27 EDT 2021 0.12/0.32 % CPUTime : 0.12/0.32 % Number of cores: 8 0.12/0.33 % Python version: Python 3.6.8 0.12/0.33 # Version: 2.6rc1-ho 0.12/0.34 # No SInE strategy applied 0.12/0.34 # Trying AutoSched0 for 59 seconds 0.55/0.73 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.55/0.73 # and selection function SelectMaxLComplexAvoidPosPred. 0.55/0.73 # 0.55/0.73 # Preprocessing time : 0.088 s 0.55/0.73 0.55/0.73 # Proof found! 0.55/0.73 # SZS status Theorem 0.55/0.73 # SZS output start CNFRefutation 0.55/0.73 thf(fact_13_ResF, axiom, ![X1:pi, X2:late_freeRes, X3:pi, X4:name]:(late_transitions @ X1 @ (late_FreeR @ X2 @ X3)=>(late_transitions @ (res @ X4 @ X1) @ (late_FreeR @ X2 @ (res @ X4 @ X3))<=fresh_1641682979reeRes @ X4 @ X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_13_ResF)). 0.55/0.73 thf(conj_0, conjecture, late_transitions @ (res @ x @ (sum @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ q2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.55/0.73 thf(fact_0_cRes_Ohyps_I2_J, axiom, fresh_1641682979reeRes @ x @ alpha, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_cRes_Ohyps_I2_J)). 0.55/0.73 thf(fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062, axiom, late_transitions @ (sum @ p @ q) @ (late_FreeR @ alpha @ q2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062)). 0.55/0.73 thf(c_0_4, plain, ![X1:pi, X2:late_freeRes, X3:pi, X4:name]:(late_transitions @ X1 @ (late_FreeR @ X2 @ X3)=>(fresh_1641682979reeRes @ X4 @ X2=>late_transitions @ (res @ X4 @ X1) @ (late_FreeR @ X2 @ (res @ X4 @ X3)))), inference(fof_simplification,[status(thm)],[fact_13_ResF])). 0.55/0.73 thf(c_0_5, plain, ![X2305:pi, X2306:late_freeRes, X2307:pi, X2308:name]:(~late_transitions @ X2305 @ (late_FreeR @ X2306 @ X2307)|(~fresh_1641682979reeRes @ X2308 @ X2306|late_transitions @ (res @ X2308 @ X2305) @ (late_FreeR @ X2306 @ (res @ X2308 @ X2307)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.55/0.73 thf(c_0_6, negated_conjecture, ~late_transitions @ (res @ x @ (sum @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ q2)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.55/0.73 thf(c_0_7, plain, ![X3:pi, X1:pi, X4:name, X2:late_freeRes]:(late_transitions @ (res @ X4 @ X1) @ (late_FreeR @ X2 @ (res @ X4 @ X3))|~late_transitions @ X1 @ (late_FreeR @ X2 @ X3)|~fresh_1641682979reeRes @ X4 @ X2), inference(split_conjunct,[status(thm)],[c_0_5])). 0.55/0.73 thf(c_0_8, plain, fresh_1641682979reeRes @ x @ alpha, inference(split_conjunct,[status(thm)],[fact_0_cRes_Ohyps_I2_J])). 0.55/0.73 thf(c_0_9, negated_conjecture, ~late_transitions @ (res @ x @ (sum @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ q2)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.55/0.73 thf(c_0_10, plain, ![X1:pi, X3:pi]:(late_transitions @ (res @ x @ X1) @ (late_FreeR @ alpha @ (res @ x @ X3))|~late_transitions @ X1 @ (late_FreeR @ alpha @ X3)), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.55/0.73 thf(c_0_11, plain, late_transitions @ (sum @ p @ q) @ (late_FreeR @ alpha @ q2), inference(split_conjunct,[status(thm)],[fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062])). 0.55/0.73 thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])]), ['proof']). 0.55/0.73 # SZS output end CNFRefutation 0.55/0.73 # Proof object total steps : 13 0.55/0.73 # Proof object clause steps : 6 0.55/0.73 # Proof object formula steps : 7 0.55/0.73 # Proof object conjectures : 4 0.55/0.73 # Proof object clause conjectures : 2 0.55/0.73 # Proof object formula conjectures : 2 0.55/0.73 # Proof object initial clauses used : 4 0.55/0.73 # Proof object initial formulas used : 4 0.55/0.73 # Proof object generating inferences : 2 0.55/0.73 # Proof object simplifying inferences : 2 0.55/0.73 # Training examples: 0 positive, 0 negative 0.55/0.73 # Parsed axioms : 431 0.55/0.73 # Removed by relevancy pruning/SinE : 0 0.55/0.73 # Initial clauses : 1028 0.55/0.73 # Removed in clause preprocessing : 143 0.55/0.73 # Initial clauses in saturation : 885 0.55/0.73 # Processed clauses : 961 0.55/0.73 # ...of these trivial : 3 0.55/0.73 # ...subsumed : 90 0.55/0.73 # ...remaining for further processing : 868 0.55/0.73 # Other redundant clauses eliminated : 28 0.55/0.73 # Clauses deleted for lack of memory : 0 0.55/0.73 # Backward-subsumed : 0 0.55/0.73 # Backward-rewritten : 0 0.55/0.73 # Generated clauses : 4049 0.55/0.73 # ...of the previous two non-trivial : 3902 0.55/0.73 # Contextual simplify-reflections : 0 0.55/0.73 # Paramodulations : 3905 0.55/0.73 # Factorizations : 2 0.55/0.73 # NegExts : 7 0.55/0.73 # Equation resolutions : 62 0.55/0.73 # Propositional unsat checks : 0 0.55/0.73 # Propositional check models : 0 0.55/0.73 # Propositional check unsatisfiable : 0 0.55/0.73 # Propositional clauses : 0 0.55/0.73 # Propositional clauses after purity: 0 0.55/0.73 # Propositional unsat core size : 0 0.55/0.73 # Propositional preprocessing time : 0.000 0.55/0.73 # Propositional encoding time : 0.000 0.55/0.73 # Propositional solver time : 0.000 0.55/0.73 # Success case prop preproc time : 0.000 0.55/0.73 # Success case prop encoding time : 0.000 0.55/0.73 # Success case prop solver time : 0.000 0.55/0.73 # Current number of processed clauses : 841 0.55/0.73 # Positive orientable unit clauses : 47 0.55/0.73 # Positive unorientable unit clauses: 0 0.55/0.73 # Negative unit clauses : 59 0.55/0.73 # Non-unit-clauses : 735 0.55/0.73 # Current number of unprocessed clauses: 3819 0.55/0.73 # ...number of literals in the above : 18194 0.55/0.73 # Current number of archived formulas : 0 0.55/0.73 # Current number of archived clauses : 0 0.55/0.73 # Clause-clause subsumption calls (NU) : 283412 0.55/0.73 # Rec. Clause-clause subsumption calls : 79285 0.55/0.73 # Non-unit clause-clause subsumptions : 70 0.55/0.73 # Unit Clause-clause subsumption calls : 6640 0.55/0.73 # Rewrite failures with RHS unbound : 0 0.55/0.73 # BW rewrite match attempts : 12 0.55/0.73 # BW rewrite match successes : 0 0.55/0.73 # Condensation attempts : 0 0.55/0.73 # Condensation successes : 0 0.55/0.73 # Termbank termtop insertions : 156382 0.55/0.73 0.55/0.73 # ------------------------------------------------- 0.55/0.73 # User time : 0.382 s 0.55/0.73 # System time : 0.022 s 0.55/0.73 # Total time : 0.404 s 0.55/0.73 # Maximum resident set size: 2568 pages 0.55/0.73 EOF